DFSGraph: Data Flow Semantic Model for Intermediate Representation Programs Based on Graph Network

نویسندگان

چکیده

With the improvement of software copyright protection awareness, code obfuscation technology plays a crucial role in protecting key segments. As becomes more and complex diverse, it has spawned large number malware variants, which make easy to evade detection anti-virus software. Malicious mainly depends on binary similarity analysis. However, existing analysis technologies are difficult deal with growing technologies. To solve this problem, paper proposes new obfuscation-resilient program method, is based data flow transformation relationship intermediate representation graph network model. In our approach, we first construct LLVM IR. Then, design novel language model networks, named DFSGraph, learn semantics from DTG. DFSGraph can detect obfuscated by extracting semantic information without deobfuscation. Extensive experiments prove that approach accurate than deobfuscation tools when searching for similar functions code.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FIRM—A Graph-Based Intermediate Representation

We present our compiler intermediate representation FIRM. Programs are always in SSA-form enabling a concise graph-based representation. We argue that this naturally encodes context information simplifying many analyses and optimizations. Instructions are connected by dependency edges relaxing the total to a partial order inside a basic block. For example alias analysis results can be directly ...

متن کامل

mortality forecasting based on lee-carter model

over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...

15 صفحه اول

A Semantic Representation Based-on Term Co-occurrence Network and Graph Kernel

This paper proposes a new semantic representation and its associated similarity measure. The representation expresses textual context observed in a context of a certain term as a network where nodes are terms and edges are the number of cooccurrences between connected terms. To compare terms represented in networks, a graph kernel is adopted as a similarity measure. The proposed representation ...

متن کامل

Model-Based Semantic Compression for Network-Data Tables

While a variety of lossy compression schemes have been developed for certain forms of digital data (e.g., images, audio, video), the area of lossy compression techniques for arbitrary data tables has been left relatively unexplored. Nevertheless, such techniques are clearly motivated by the ever-increasing data collection rates of modern enterprises and the need for effective, guaranteedquality...

متن کامل

Graph-Based Generalized Latent Semantic Analysis For Document Representation

Document indexing and representation of term-document relations are very important for document clustering and retrieval. In this paper, we combine a graph-based dimensionality reduction method with a corpus-based association measure within the Generalized Latent Semantic Analysis framework. We evaluate the graph-based GLSA on the document clustering task.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11193230